Exploring Binary Trees in C#

What is the purpose of binary tree traversal?

• To delete nodes from the tree efficiently.

• To create a balanced tree structure.

• The purpose of binary tree traversal is to access and process each node in the tree.

• To convert the tree into a linked list.

Name the three common methods of binary tree traversal.

• Level-order, Depth-first, Breadth-first

• In-order, Level-order, Reverse-order

• Pre-order, Post-order, Random-order

• In-order, Pre-order, Post-order

How do you implement a binary tree in C#?

• class TreeNode { public int Value; }

• class BinaryTree { public void AddNode(int value) { } }

• class TreeNode { public int Value; public TreeNode Left; public TreeNode Right; public TreeNode(int value) { Value = value; Left = null; Right = null; } } class BinaryTree { public TreeNode Root; public void Insert(int value) { /* Insertion logic */ } public void Traverse() { /* Traversal logic */ } }

• class BinaryTree { public TreeNode Root; public void Delete(int value) { } }

What is the difference between a binary tree and a binary search tree?

• A binary tree can have any number of children; a binary search tree can only have two.

• A binary tree is always balanced; a binary search tree is not necessarily balanced.

• A binary tree is used for sorting; a binary search tree is used for storing data.

• A binary tree is a general tree structure; a binary search tree is a binary tree with ordered nodes.

Explain how a binary search tree maintains order.

• A binary search tree allows duplicate values on both sides of the parent.

• A binary search tree maintains order by ensuring left children are less than their parent and right children are greater.

• A binary search tree requires all nodes to be equal to their parent.

• A binary search tree maintains order by randomly placing nodes.

What are some common tree balancing techniques?

• Binary Search Trees

• Heap Trees

• Segment Trees

• Common tree balancing techniques include AVL trees, Red-Black trees, Splay trees, and B-trees.

How does the height of a binary tree differ from its depth?

• The height of a binary tree is always equal to its depth regardless of the structure.

• Height measures the number of edges from the root to the deepest node, while depth measures the number of nodes in the tree.

• The height is the total number of nodes in the tree, while depth is the longest path from the root to any node.

• The height of a binary tree is the longest path from the root to a leaf, while depth refers to the path length from the root to a specific node.

What is the time complexity of searching in a balanced binary search tree?

• O(log n)

• O(n)

• O(n log n)

• O(1)

Describe how to perform an in-order traversal of a binary tree.

• Traverse the tree by visiting the right subtree, current node, then left subtree.

• Visit nodes in the order: current node, left subtree, right subtree.

• Perform a pre-order traversal by visiting the right subtree first.

• In-order traversal visits nodes in the order: left subtree, current node, right subtree.

What is a leaf node in a binary tree?

• A leaf node is a node with one child in a binary tree.

• A leaf node is a node with no children in a binary tree.

• A leaf node is the root of the binary tree.

• A leaf node is a node that has at least two children in a binary tree.