Cisco Networking Academy Software Engineer Interview Questions and Answers

Round duration - 50 minutes
Round difficulty - Medium

Two panellist were there, one was asking question based upon CN + OS + DBMS, one was asking question based upon DS + Algo.

Q1. 
Binary Search Tree Insertion
Given the root node of a binary search tree and a positive integer, you need to insert a new node with the given value into the BST so that the resulting tree maintains the pr...read more
Ans. 
Insert a new node with a given value into a binary search tree while maintaining BST properties.
• Parse input for tree elements and value to be inserted

• Insert the new node into the BST while maintaining BST properties

• Return '1' if a correct tree configuration is achieved, else '0'
Answered by AI
Add your answer
Q2. 
LCA in a Binary Search Tree
You are given a binary search tree (BST) containing N nodes. Additionally, you have references to two nodes, P and Q, within this BST.
Your task is to determine the Lowest Com...read more
Ans. 
The task is to find the Lowest Common Ancestor (LCA) of two nodes in a Binary Search Tree (BST).
• Traverse the BST from the root to find the LCA of nodes P and Q.

• Compare the values of nodes P and Q with the current node's value to determine the path to follow.

• Continue traversing until you find the LCA node.

• If one node is the ancestor of the other, return that node as the LCA.

• Example: For input 2 3 and BST 1 2 3 4 -1 5 6 ...read more
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

Round duration - 15 Minutes
Round difficulty - Easy