본문 바로가기

자료구조14

[자료구조] Display Circular Linked List in Reverse Order. (recursive call) 참고자료 https://www.javatpoint.com/program-to-create-a-circular-linked-list-of-n-nodes-and-display-it-in-reverse-order Program to Create a Circular Linked List of N Nodes and Display it in Reverse Order - javatpoint Program to Create a Circular Linked List of N Nodes and Display it in Reverse Order on fibonacci, factorial, prime, armstrong, swap, reverse, search, sort, stack, queue, array, linkedli.. 2020. 2. 25.
[자료구조] To Create circular linked list and count . (feat. do-while) 참고자료 https://www.javatpoint.com/program-to-create-a-circular-linked-list-of-n-nodes-and-count-the-number-of-nodes Program to Create a Circular Linked List of N Nodes and Count the Number of Nodes - javatpoint Program to Create a Circular Linked List of N Nodes and Count the Number of Nodes on fibonacci, factorial, prime, armstrong, swap, reverse, search, sort, stack, queue, array, linkedlist, tr.. 2020. 2. 25.
[자료구조] sorting the element of the doubly linked list (feat.for loop) 참고자료 https://www.javatpoint.com/program-to-sort-the-elements-of-the-doubly-linked-list Program to Sort the Elements of the Doubly Linked List - javatpoint Program to Sort the Elements of the Doubly Linked List on fibonacci, factorial, prime, armstrong, swap, reverse, search, sort, stack, queue, array, linkedlist, tree, graph etc. www.javatpoint.com Data structure를 공부하며 node를 swap하는 것에 익숙해진 상황이었다.. 2020. 2. 25.
[자료구조] Program to convert a given binary tree to doubly linked list Binary tree(이진트리) 란? -자료를 저장하는 구조의 한 종류로써 하나의 node에 최대 두 개의 children이 좌 우로 존재하는 형태. ex)정이진트리, 완전이진트리 등 주어진 binary tree를 doubly linked list로 변환하는 코드를 리뷰해보겠습니다. https://www.javatpoint.com/program-to-convert-a-given-binary-tree-to-doubly-linked-list Program to Convert a Given Binary Tree to Doubly Linked List - javatpoint Program to Convert a Given Binary Tree to Doubly Linked List on fibonacci, fa.. 2020. 2. 17.