binary-search-tree

问题 I'm trying to solve this problem but I'm having some troubles: In a binary search tree (BST): The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node: class Node { int data; Node left; Node right; } Determine if the binary tree is also a binary search tree I have this code: boolean check(Node root) { //node doesn't have any children if

问题 I'm trying to solve this problem but I'm having some troubles: In a binary search tree (BST): The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node: class Node { int data; Node left; Node right; } Determine if the binary tree is also a binary search tree I have this code: boolean check(Node root) { //node doesn't have any children if

问题 I am unsure how to set a pointer to a pointer to build a tree. Like once I have traveled to a leaf and call insert, how should I insert another element calling insert with the root node or the address of the root pointer? I think the problem with this function is the name root where that should be the double pointer right? #include "bst.h" #include <stdio.h> #include <stdlib.h> //arbitrary list of temp nodes TreeNode *new_node, *root, *tmp, *parent; int elemArray[100], i1, i2, i0; int main(

问题 I have got a question, and it says "calculate the tight time complexity for the process of inserting n numbers into a binary search tree". It does not denote whether this is a balanced tree or not. So, what answer can be given to such a question? If this is a balanced tree, then height is logn, and inserting n numbers take O(nlogn) time. But this is unbalanced, it may take even O(n 2 ) time in the worst case. What does it mean to find the tight time complexity of inserting n numbers to a bst?

问题 I want to "paint" the tree on screen using CSS and HTML and not represent it in any way or data structure ... 回答1: A very simple way of creating a tree-like structure with HTML and CSS is nesting <div> s Each div represents a node, and can have multiple nodes inside: <div> //root <div> //child 1 <div> //child 1.1 <div></div> //child 1.1.1 <div></div> //child 1.1.2 <div></div> //child 1.1.3 </div> <div></div> //child 1.2 </div> <div></div> //child 2 </div> Then you can add a margin-top to all

问题 I want to "paint" the tree on screen using CSS and HTML and not represent it in any way or data structure ... 回答1: A very simple way of creating a tree-like structure with HTML and CSS is nesting <div> s Each div represents a node, and can have multiple nodes inside: <div> //root <div> //child 1 <div> //child 1.1 <div></div> //child 1.1.1 <div></div> //child 1.1.2 <div></div> //child 1.1.3 </div> <div></div> //child 1.2 </div> <div></div> //child 2 </div> Then you can add a margin-top to all

问题 I have bought a nice little book about computational geometry. While reading it here and there, I often stumbled over the use of this special kind of binary search tree. These trees are balanced and should store the data only in the leaf nodes, whereas inner nodes should only store values to guide the search down to the leaves. The following image shows an example of this trees (where the leaves are rectangles and the inner nodes are circles). I have two questions: What is the advantage of

问题 Given a bst with integer values as keys how do I find the closest node to that key in a bst ? The BST is represented using a object of nodes (Java). Closest will be for eg 4,5,9 and if the key is 6 it will return 5 .. 回答1: Traverse the tree as you would to find the element. While you do that record the value that is closest to your key. Now when you didn't find a node for the key itself return the recorded value. So if you were looking for the key 3 in the following tree you would end up on

问题 In c++ I am working on two trees, 1 is alphabetical a-z with nums and characters 0-9 , . ? The other tree is the equivalent of those characters in Morse code. I have to have the different trees in text files that should already be in the correct order for insert. In my normal alphabet, I worked out my balanced text file for preorder traversal looks like P H D B A C F E G L J I K N M O 2 X T R Q S V U W 0 Y Z 1 9 5 4 3 7 6 8 , . ? This text file prints out preorder traversal , . 0 1 2 3 4 5 6

问题 I'm trying to make a balance_bst(bstNode root) function, but i'm struggling with the implementation. I'm implementing the function as a template function, since my bstNode class is a template class. Here is (some of) my code: template<class Item, class Key> class bstNode{ public: //Constructor bstNode(const Item& init_data = Item(), const Key& init_key = Key(), bstNode<Item, Key>* l_child = NULL, bstNode<Item, Key>* r_child = NULL){ data_field = init_data; key_field = init_key; l_ptr = l