Save
Busy. Please wait.
Log in with Clever
or
show password
Forgot Password?
Don't have an account?  Sign up 
Sign up using Clever
or
Username is available taken
show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account. Your email address is only used to allow you to reset your password. See our Privacy Policy and Terms of Service.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.
focusNode
Didn't know it?
click below
 
Knew it?
click below
Don't Know
Remaining cards (0)
Know
0:00
edit
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

Trees

QuestionAnswer
A binary tree is either ___ or it has a special node called the ___ node. empty root
If the tree is nonempty, the root node may have up to two sets of nodes, called the left and right subtrees, such that the left and right subtrees are also ___ trees. binary
The node of a binary tree has ___ links to the descendant nodes in the tree. two
A node in the binary tree is called a ___ if it has no left and right children. leaf
The ___ of a path in a binary tree is the number of branches (edges) on that path. length
The ___ of a node in a binary tree is the number of branches (edges) on the path from the root to the node. level
The level of the root node of a binary tree is ___, and the level of the children of the root node is ___ 0, 1
The height of a binary tree is the number of nodes on the ___ path from the root to a leaf. longest
In an ___ traversal, the binary tree is traversed as follows: • Traverse the left subtree • Visit the node • Traverse the right subtree inorder
In a ___ traversal, the binary tree is traversed as follows: • Visit the node • Traverse the left subtree • Traverse the right subtree preorder
In a ___ traversal, the binary tree is traversed as follows: • Traverse the left subtree • Traverse the right subtree • Visit the node postorder
Bi Search Tree T is either empty or •has special node called _ node •has 2 sets of nodes LT&RT called _ subtree & __ subtree of T • Key in root node is __ than every key in the l subtree & __ than every key in the r subtree& • LT&RT are __ search trees root, left, right, larger, smaller, binary
Created by: Araceli05Gomez
Popular Computers sets

 

 



Voices

Use these flashcards to help memorize information. Look at the large card and try to recall what is on the other side. Then click the card to flip it. If you knew the answer, click the green Know box. Otherwise, click the red Don't know box.

When you've placed seven or more cards in the Don't know box, click "retry" to try those cards again.

If you've accidentally put the card in the wrong box, just click on the card to take it out of the box.

You can also use your keyboard to move the cards as follows:

If you are logged in to your account, this website will remember which cards you know and don't know so that they are in the same box the next time you log in.

When you need a break, try one of the other activities listed below the flashcards like Matching, Snowman, or Hungry Bug. Although it may feel like you're playing a game, your brain is still making more connections with the information to help you out.

To see how well you know the information, try the Quiz or Test activity.

Pass complete!
"Know" box contains:
Time elapsed:
Retries:
restart all cards