HTTPS HTTPS란? HTTPS는 보안계층인 SSL/TLS를 이용해 HTTP의 보안을 강화한 웹 통신 프로토콜이다. 데이터 암호화를 거치지 않고 전송해 보안에 취약한 HTTP의 단점을 보완하기 위해 등장했다. HTTPS는 SSL이나 TLS 프로토콜을 통해 세션 데이터를 암호화한다. → SSL(Secure Sockets Layer)은 넷스케이프에서 개발한 암호화 프로토콜 → 당시 SSL의 몇 가지 문제점을 보완해 새로운 암호화 프로토콜인 TLS(Transport Layer Security) 개발 → 현재 통용되는 방식은 TLS이지만 명칭을 SSL 또는 SSL/TLS라고 부름 HTTP → SSL/TLS → TCP → IP → 네트워크 인터페이스 HTTP는 원래 TCP와 직접 통신했지만, HTTPS에서 H..
Average of Levels in Binary Tree - LeetCode Can you solve this real interview question? Average of Levels in Binary Tree - Given the root of a binary tree, return the average value of the nodes on each level in the form of an array. Answers within 10-5 of the actual answer will be accepted. Examp leetcode.com 문제 더보기 Given the root of a binary tree, return the average value of the nodes on each l..
Binary Tree Right Side View - LeetCode Can you solve this real interview question? Binary Tree Right Side View - Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example 1: [https://asse leetcode.com 문제 더보기 Given the root of a binary tree, imagine yourself standing on the right side of it, r..
Kth Smallest Element in a BST - LeetCode Can you solve this real interview question? Kth Smallest Element in a BST - Given the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the values of the nodes in the tree. Example 1: [https://assets.leetco leetcode.com 문제 더보기 Given the root of a binary search tree, and an integer k, return the kth smallest v..
Minimum Absolute Difference in BST - LeetCode Can you solve this real interview question? Minimum Absolute Difference in BST - Given the root of a Binary Search Tree (BST), return the minimum absolute difference between the values of any two different nodes in the tree. Example 1: [https://assets.l leetcode.com 문제 더보기 Given the root of a Binary Search Tree (BST), return the minimum absolute diff..
