AI coding assistant for busy programmers

All

JavaScript

make a binary search tree algorithm in MATLAB

MATLAB

function binarySearchTree(data)
    % Create a root node
    root = struct('data', data, 'left', [], 'right', []);

% Insert a new node into the tree
    function insertNode(node, data)
        if data < node.data  % Go left
            if isempty(node.left)  % If there is no left child, create one
                node.left = struct('data', data, 'left', [], 'right', []);
            else  % Otherwise recursively call insertNode on the left child
                insertNode(node.left, data);
            end

else  % Go right
            if isempty(node.right)  % If there is no right child, create one
                node.right = struct('data', data, 'left', [], 'right', []);
            else  % Otherwise recursively call insertNode on the right child
                insertNode(node.right, data);  
            end

end

for i=2:length(data)  % Start at 2 since we already have a root node created above  
        insertNode(root, data(i));

end

disp('Binary Search Tree:');

dispTree(root);

function dispTree(node)

if ~isempty(node.left)

dispTree(node.left);

end

fprintf('%d\n', node.data);

if ~isempty(node.right)

dispTree(node.right);

end     												                                                                                                                             end    
end

🤖 Code Explanation

It creates a binary search tree from a given array of data.

AI coding assistant for busy programmers

make a binary search tree algorithm in MATLAB

MATLAB

🤖 Code Explanation

More problems solved in MATLAB